#include<bits/stdc++.h>
#define ll long long
#define L x<<1
#define R x<<1|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,n
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(int x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=1e6+5,M=7e6+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,ans,a[N],s[N],tp,lk[N];
string t;
struct seg{
	int w,mn;//和，最小后缀和
	int c;//前缀所耗费的次数
}xd[N<<2],c;
inline seg getup(seg a,seg b){
	c.w=a.w+b.w;
	c.mn=min(b.mn,b.w+a.mn);
	c.c=a.c+b.c;
	return c;
}
inline void modify(int x,int l,int r,int p,int ty){
	if(l==r){
		if(!ty)xd[x]={-1,-1,0};
		else if(ty==1)xd[x]={1,1,0};
		else xd[x]={0,-1,1};
		return;
	}
	p<=mid?modify(lc,p,ty):modify(rc,p,ty);
	xd[x]=getup(xd[L],xd[R]);
}
inline seg query(int x,int l,int r,int Ll,int Rr){
	if(OK)return xd[x];
	if(Rr<=mid)return query(lc,Ll,Rr);
	if(Ll>mid)return query(rc,Ll,Rr);
	return getup(query(lc,Ll,Rr),query(rc,Ll,Rr));
}
vector<int>p[N];
inline void Main(){
	n=read(),m=read(),cin>>t,t='#'+t;
	repn(i)a[i]=t[i]-'0';
	repn(i)if(a[i])s[++tp]=i;
	else if(tp)lk[s[tp]]=i,lk[i]=s[tp],tp--;
	while(m--){
		int l=read(),r=read();
		p[l].pb(r);
	}
	per(i,n,1){
		modify(Root,i,a[i]==1?1:2);
		if(lk[i]>i)modify(Root,lk[i],0);
		E(i){
			c=query(Root,i,y);
			ans^=c.c+max(0,-c.mn);
		}
	}
	cout <<ans;
}
signed main(){
	freopen("good.in","r",stdin);
	freopen("good.out","w",stdout);
	int T=1;
	while(T--)Main();
	return 0;
}
